mGPT: A Probabilistic Planner Based on Heuristic Search
نویسندگان
چکیده
منابع مشابه
mGPT: A Probabilistic Planner Based on Heuristic Search
We describe the version of the GPT planner used in the probabilistic track of the 4th International Planning Competition (ipc-4). This version, called mGPT, solves Markov Decision Processes specified in the ppddl language by extracting and using different classes of lower bounds along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations where t...
متن کاملHeuristic Search Planner 2.0
We describe the HSP2.0 planning algorithm that entered the Second Planning Contest held in AIPS2000. HSP2.0 is a domain independent planning algorithm that implements the family of heuristic search planners that are characterized by the state space that is searched (either progression or regression space), the search algorithm used, and the heuristic function that is used. This general planner ...
متن کاملBFHSP: A Breadth-First Heuristic Search Planner
Our Breadth-First Heuristic Search Planner (BFHSP) is a domain-independent STRIPS planner that finds sequential plans that are optimal with respect to the number of actions it takes to reach a goal. We developed BFHSP as part of our research on space-efficient graph search. It uses breadth-first search since we found that breadth-first search is more efficient than best-first search when divide...
متن کاملMarvin: A Heuristic Search Planner with Online Macro-Action Learning
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macroactions, which are then used during search for a solution plan. We provide an overview of its architecture and search behaviour, detailing the algorithms used. We also empirically demonstrate the effectiveness of its f...
متن کاملFluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating states individually, and heuristic search that avoids evaluating all states. Firstly, in contrast to existing systems, which start with propositionalizing the FOMDP and then perform state abstraction on its propositionaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2005
ISSN: 1076-9757
DOI: 10.1613/jair.1688